Intersection problems in the q-ary cube
نویسندگان
چکیده
منابع مشابه
Intersection problems in the q-ary cube
We propose new intersection problems in the q-ary n-dimensional hypercube. The answers to the problems include the Katona’s t-intersection theorem and the Erdős–Ko–Rado theorem as special cases. We solve some of the basic cases of our problems, and for example we get an Erdős–Ko–Rado type result for t-intersecting k-uniform families of multisets with bounded repetitions. Another example is obta...
متن کاملOn perfect 2-colorings of the q-ary n-cube
A coloring of a q-ary n-dimensional cube (hypercube) is called perfect if, for every n-tuple x, the collection of the colors of the neighbors of x depends only on the color of x. A Boolean-valued function is called correlation-immune of degree n − m if it takes value 1 the same number of times for each m-dimensional face of the hypercube. Let f = χ S be a characteristic function of a subset S o...
متن کاملq-ary Compressive Sensing
We introduce q-ary compressive sensing, an extension of 1-bit compressive sensing. We propose a novel sensing mechanism and a corresponding recovery procedure. The recovery properties of the proposed approach are analyzed both theoretically and empirically. Results in 1-bit compressive sensing are recovered as a special case. Our theoretical results suggest a tradeoff between the quantization p...
متن کاملfficient q-ary immuta
A fixed length code is called immutable if no codeword can be transformed into another codeword by using only a restricted set of symbol changes. Immutable codes are used to prevent undetectable updates of information stored over write-once memories 1141. In this paper we consider immutable codes on the alphabet Q = (0, . . . , q11. We prove that a maximum size immutable code of block length n ...
متن کاملCube intersection concepts in median graphs
In this paper, we study different classes of intersection graphs of maximal hypercubes of median graphs. For a median graph G and k ≥ 0, the intersection graph Qk(G) is defined as the graph whose vertices are maximal hypercubes (by inclusion) in G, and two vertices Hx and Hy in Qk(G) are adjacent whenever the intersection Hx ∩ Hy contains a subgraph isomorphic to Qk. Characterizations of clique...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2016
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2016.02.006